'Weak Dependency Graph [60.0]'
------------------------------
Answer:           YES(?,O(n^1))
Input Problem:    innermost runtime-complexity with respect to
  Rules:
    {  a(b(a(x1))) -> b(c(x1))
     , b(b(b(x1))) -> c(b(x1))
     , c(x1) -> a(b(x1))
     , c(d(x1)) -> d(c(b(a(x1))))}

Details:         
  We have computed the following set of weak (innermost) dependency pairs:
   {  a^#(b(a(x1))) -> c_0(b^#(c(x1)))
    , b^#(b(b(x1))) -> c_1(c^#(b(x1)))
    , c^#(x1) -> c_2(a^#(b(x1)))
    , c^#(d(x1)) -> c_3(c^#(b(a(x1))))}
  
  The usable rules are:
   {  a(b(a(x1))) -> b(c(x1))
    , b(b(b(x1))) -> c(b(x1))
    , c(x1) -> a(b(x1))
    , c(d(x1)) -> d(c(b(a(x1))))}
  
  The estimated dependency graph contains the following edges:
   {a^#(b(a(x1))) -> c_0(b^#(c(x1)))}
     ==> {b^#(b(b(x1))) -> c_1(c^#(b(x1)))}
   {b^#(b(b(x1))) -> c_1(c^#(b(x1)))}
     ==> {c^#(d(x1)) -> c_3(c^#(b(a(x1))))}
   {b^#(b(b(x1))) -> c_1(c^#(b(x1)))}
     ==> {c^#(x1) -> c_2(a^#(b(x1)))}
   {c^#(x1) -> c_2(a^#(b(x1)))}
     ==> {a^#(b(a(x1))) -> c_0(b^#(c(x1)))}
   {c^#(d(x1)) -> c_3(c^#(b(a(x1))))}
     ==> {c^#(d(x1)) -> c_3(c^#(b(a(x1))))}
   {c^#(d(x1)) -> c_3(c^#(b(a(x1))))}
     ==> {c^#(x1) -> c_2(a^#(b(x1)))}
  
  We consider the following path(s):
   1) {  a^#(b(a(x1))) -> c_0(b^#(c(x1)))
       , c^#(x1) -> c_2(a^#(b(x1)))
       , c^#(d(x1)) -> c_3(c^#(b(a(x1))))
       , b^#(b(b(x1))) -> c_1(c^#(b(x1)))}
      
      The usable rules for this path are the following:
      {  a(b(a(x1))) -> b(c(x1))
       , b(b(b(x1))) -> c(b(x1))
       , c(x1) -> a(b(x1))
       , c(d(x1)) -> d(c(b(a(x1))))}
      
        We have applied the subprocessor on the union of usable rules and weak (innermost) dependency pairs.
        
          'Weight Gap Principle'
          ----------------------
          Answer:           YES(?,O(n^1))
          Input Problem:    innermost runtime-complexity with respect to
            Rules:
              {  a(b(a(x1))) -> b(c(x1))
               , b(b(b(x1))) -> c(b(x1))
               , c(x1) -> a(b(x1))
               , c(d(x1)) -> d(c(b(a(x1))))
               , a^#(b(a(x1))) -> c_0(b^#(c(x1)))
               , c^#(x1) -> c_2(a^#(b(x1)))
               , c^#(d(x1)) -> c_3(c^#(b(a(x1))))
               , b^#(b(b(x1))) -> c_1(c^#(b(x1)))}
          
          Details:         
            We apply the weight gap principle, strictly orienting the rules
            {c^#(x1) -> c_2(a^#(b(x1)))}
            and weakly orienting the rules
            {}
            using the following strongly linear interpretation:
              Processor 'Matrix Interpretation' oriented the following rules strictly:
              
              {c^#(x1) -> c_2(a^#(b(x1)))}
              
              Details:
                 Interpretation Functions:
                  a(x1) = [1] x1 + [0]
                  b(x1) = [1] x1 + [0]
                  c(x1) = [1] x1 + [0]
                  d(x1) = [1] x1 + [0]
                  a^#(x1) = [1] x1 + [1]
                  c_0(x1) = [1] x1 + [1]
                  b^#(x1) = [1] x1 + [0]
                  c_1(x1) = [1] x1 + [0]
                  c^#(x1) = [1] x1 + [5]
                  c_2(x1) = [1] x1 + [0]
                  c_3(x1) = [1] x1 + [4]
              
            Finally we apply the subprocessor
            We apply the weight gap principle, strictly orienting the rules
            {c^#(d(x1)) -> c_3(c^#(b(a(x1))))}
            and weakly orienting the rules
            {c^#(x1) -> c_2(a^#(b(x1)))}
            using the following strongly linear interpretation:
              Processor 'Matrix Interpretation' oriented the following rules strictly:
              
              {c^#(d(x1)) -> c_3(c^#(b(a(x1))))}
              
              Details:
                 Interpretation Functions:
                  a(x1) = [1] x1 + [0]
                  b(x1) = [1] x1 + [0]
                  c(x1) = [1] x1 + [0]
                  d(x1) = [1] x1 + [8]
                  a^#(x1) = [1] x1 + [1]
                  c_0(x1) = [1] x1 + [1]
                  b^#(x1) = [1] x1 + [0]
                  c_1(x1) = [1] x1 + [0]
                  c^#(x1) = [1] x1 + [1]
                  c_2(x1) = [1] x1 + [0]
                  c_3(x1) = [1] x1 + [0]
              
            Finally we apply the subprocessor
            We apply the weight gap principle, strictly orienting the rules
            {a^#(b(a(x1))) -> c_0(b^#(c(x1)))}
            and weakly orienting the rules
            {  c^#(d(x1)) -> c_3(c^#(b(a(x1))))
             , c^#(x1) -> c_2(a^#(b(x1)))}
            using the following strongly linear interpretation:
              Processor 'Matrix Interpretation' oriented the following rules strictly:
              
              {a^#(b(a(x1))) -> c_0(b^#(c(x1)))}
              
              Details:
                 Interpretation Functions:
                  a(x1) = [1] x1 + [0]
                  b(x1) = [1] x1 + [0]
                  c(x1) = [1] x1 + [0]
                  d(x1) = [1] x1 + [0]
                  a^#(x1) = [1] x1 + [1]
                  c_0(x1) = [1] x1 + [0]
                  b^#(x1) = [1] x1 + [0]
                  c_1(x1) = [1] x1 + [1]
                  c^#(x1) = [1] x1 + [8]
                  c_2(x1) = [1] x1 + [0]
                  c_3(x1) = [1] x1 + [0]
              
            Finally we apply the subprocessor
            We apply the weight gap principle, strictly orienting the rules
            {c(x1) -> a(b(x1))}
            and weakly orienting the rules
            {  a^#(b(a(x1))) -> c_0(b^#(c(x1)))
             , c^#(d(x1)) -> c_3(c^#(b(a(x1))))
             , c^#(x1) -> c_2(a^#(b(x1)))}
            using the following strongly linear interpretation:
              Processor 'Matrix Interpretation' oriented the following rules strictly:
              
              {c(x1) -> a(b(x1))}
              
              Details:
                 Interpretation Functions:
                  a(x1) = [1] x1 + [0]
                  b(x1) = [1] x1 + [0]
                  c(x1) = [1] x1 + [2]
                  d(x1) = [1] x1 + [5]
                  a^#(x1) = [1] x1 + [4]
                  c_0(x1) = [1] x1 + [0]
                  b^#(x1) = [1] x1 + [2]
                  c_1(x1) = [1] x1 + [1]
                  c^#(x1) = [1] x1 + [4]
                  c_2(x1) = [1] x1 + [0]
                  c_3(x1) = [1] x1 + [1]
              
            Finally we apply the subprocessor
            We apply the weight gap principle, strictly orienting the rules
            {a(b(a(x1))) -> b(c(x1))}
            and weakly orienting the rules
            {  c(x1) -> a(b(x1))
             , a^#(b(a(x1))) -> c_0(b^#(c(x1)))
             , c^#(d(x1)) -> c_3(c^#(b(a(x1))))
             , c^#(x1) -> c_2(a^#(b(x1)))}
            using the following strongly linear interpretation:
              Processor 'Matrix Interpretation' oriented the following rules strictly:
              
              {a(b(a(x1))) -> b(c(x1))}
              
              Details:
                 Interpretation Functions:
                  a(x1) = [1] x1 + [1]
                  b(x1) = [1] x1 + [0]
                  c(x1) = [1] x1 + [1]
                  d(x1) = [1] x1 + [1]
                  a^#(x1) = [1] x1 + [15]
                  c_0(x1) = [1] x1 + [0]
                  b^#(x1) = [1] x1 + [0]
                  c_1(x1) = [1] x1 + [8]
                  c^#(x1) = [1] x1 + [15]
                  c_2(x1) = [1] x1 + [0]
                  c_3(x1) = [1] x1 + [0]
              
            Finally we apply the subprocessor
            'fastest of 'combine', 'Bounds with default enrichment', 'Bounds with default enrichment''
            ------------------------------------------------------------------------------------------
            Answer:           YES(?,O(n^1))
            Input Problem:    innermost relative runtime-complexity with respect to
              Strict Rules:
                {  b(b(b(x1))) -> c(b(x1))
                 , c(d(x1)) -> d(c(b(a(x1))))
                 , b^#(b(b(x1))) -> c_1(c^#(b(x1)))}
              Weak Rules:
                {  a(b(a(x1))) -> b(c(x1))
                 , c(x1) -> a(b(x1))
                 , a^#(b(a(x1))) -> c_0(b^#(c(x1)))
                 , c^#(d(x1)) -> c_3(c^#(b(a(x1))))
                 , c^#(x1) -> c_2(a^#(b(x1)))}
            
            Details:         
              The problem was solved by processor 'Bounds with default enrichment':
              'Bounds with default enrichment'
              --------------------------------
              Answer:           YES(?,O(n^1))
              Input Problem:    innermost relative runtime-complexity with respect to
                Strict Rules:
                  {  b(b(b(x1))) -> c(b(x1))
                   , c(d(x1)) -> d(c(b(a(x1))))
                   , b^#(b(b(x1))) -> c_1(c^#(b(x1)))}
                Weak Rules:
                  {  a(b(a(x1))) -> b(c(x1))
                   , c(x1) -> a(b(x1))
                   , a^#(b(a(x1))) -> c_0(b^#(c(x1)))
                   , c^#(d(x1)) -> c_3(c^#(b(a(x1))))
                   , c^#(x1) -> c_2(a^#(b(x1)))}
              
              Details:         
                The problem is Match-bounded by 0.
                The enriched problem is compatible with the following automaton:
                {  a_0(4) -> 12
                 , b_0(4) -> 14
                 , b_0(11) -> 16
                 , b_0(12) -> 11
                 , d_0(4) -> 4
                 , a^#_0(4) -> 5
                 , a^#_0(14) -> 13
                 , a^#_0(16) -> 15
                 , b^#_0(4) -> 7
                 , c^#_0(4) -> 9
                 , c^#_0(11) -> 10
                 , c_2_0(13) -> 9
                 , c_2_0(15) -> 10
                 , c_3_0(10) -> 9}